Reconstructing Broadcasts on Trees
نویسنده
چکیده
Given a branching Markov process on a tree, the goal of the reconstruction (or “broadcast”) problem is to guess the initial condition at the root, given the states of the leaves. In this essay, we evaluate the performance of some algorithms, new and old, for solving the reconstruction problem.
منابع مشابه
Reconstructing the temperature degree of the warm seasons through Quercus persica tree rings in Zagros forests Dena region
Trees can record long-term effects of climate variables. Using dendroclimatology knowledge, we can reconstruct such variables especially for areas which have short-term climatic data. For this purpose, we reconstructed the temperature degree of the warm months (May-September) through annual rings width of Quercus persica and regression analysis of data obtained from stations on Dena region. Wit...
متن کاملA class of trees with equal broadcast and domination numbers
A broadcast on a graph G is a function f : V → {0, 1, 2, . . . }. The broadcast number of G is the minimum value of ∑ v∈V f(v) among all broadcasts f for which each vertex of G is within distance f(v) from some vertex v with f(v) ≥ 1. The broadcast number is bounded above by the radius and the domination number of G. We consider a class of trees that contains the caterpillars and characterize t...
متن کاملDominating 2-broadcast in Graphs: Complexity, Bounds and Extremal Graphs
Limited dominating broadcasts were proposed as a variant of dominating broadcasts, where the broadcast function is upper bounded. As a natural extension of domination, we consider dominating 2-broadcasts along with the associated parameter, the dominating 2-broadcast number. We prove that computing the dominating 2-broadcast number is a NP-complete problem, but can be achieved in linear time fo...
متن کاملAnalyzing the fitch method for reconstructing ancestral states on ultrametric phylogenetic trees.
The accuracy of the Fitch method for reconstructing ancestral states on ultrametric phylogenetic trees is studied. Two recurrence relations for computing the accuracy are given here. Using these relations, we analyze the convergence of the accuracy of the Fitch method for reconstructing the root state on a complete binary tree of 2( n ) leaves as n goes to infinity, present a closed-form formul...
متن کاملApplication-Oriented Adaptive MPI Bcast for Grids
Due to the importance of collective communications in scientific parallel applications, many strategies have been devised for optimizing collective communications for different kinds of parallel environments. Recently, there has been an increasing interest to evolve efficient broadcast algorithms for computational Grids. In this paper, we present application-oriented adaptive techniques that ta...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2012